Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
Authors
Abstract:
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large objects placement problem) and has many industrial applications like in wood and steel industries. The proposed Iterated Local Search algorithm in which we use a constructive heuristic and a local search move based on reducing pieces. The algorithm is tested on well known instances from the literature. Our computational results are very competitive compared to the best known solutions of literature and improve a part of them.
similar resources
A tabu search algorithm for a two-dimensional non-guillotine cutting problem
In this paper we study the two-dimensional non-guillotine cutting problem, the problem of cutting rectangular pieces from a large stock rectangle so as to maximize the total value of the pieces cut. The problem has many industrial applications whenever small pieces have to be cut from or packed into a large stock sheet. We propose a tabu search algorithm. Several moves based on reducing and ins...
full textA DC programming approach for the constrained two - dimensional non - guillotine cutting problem ⋆
We investigate a new application of DC (Difference of Convex functions) programming and DCA (DC Algorithm) in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reform...
full textA Hybrid Heuristic for the Constrained Two-dimensional Non-guillotine Orthogonal Cutting Problem
This paper addresses a constrained two-dimensional (2D) non-guillotine cutting problem, where a fixed set of small rectangles has to be cut from a larger stock rectangle so as to maximize the value of the rectangles cut. The algorithm we propose hybridizes a novel placement procedure with a genetic algorithm based on random keys. We propose also a new fitness function to drive the optimization....
full textA DC programming approach for constrained two-dimensional non-guillotine cutting problem
We investigate a new application of DC (Difference of Convex functions) programming and DCA (DC Algorithm) in solving the constrained two-dimensional non-guillotine cutting problem. This problem consists of cutting a number of rectangular pieces from a large rectangular object. The cuts are done under some constraints and the objective is to maximize the total value of the pieces cut. We reform...
full textA GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
This paper presents a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional non-guillotine cutting problem, the problem of cutting the rectangular pieces from a large rectangle so as to maximize the value of the pieces cut. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perfor...
full textMy Resources
Journal title
volume 2 issue 3
pages 164- 179
publication date 2008-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023